Compactness and Flow Minimization Requirements in Reforestation Initiatives: An Integer Programming (IP) Formulation

نویسندگان

  • Pablo Vanegas
  • Dirk Cattrysse
  • Jos Van Orshoven
چکیده

Identifying optimal sites on raster maps is a complex problem when the sites are larger than the cell size. Optimal sites involves a tradeoff between the intrinsic characteristics of individual cells and the spatial configuration of the cells. Although there are a number of techniques to solve the site allocation problem, those solutions do not consider spatial interactions between the cells forming the site. This paper presents an Integer Programming Formulation (IP) for allocating a predefined number of cells satisfying the following criteria: 1) minimize flow (water, sediment) reaching the outlet of a watershed, 2) maximize/minimize intrinsic characteristics of the cells, and 3) form a compact patch. Although the core structure of the IP formulation can be applied for different sorts of flow and intrinsic characteristics, it is targeted to a reforestation application. The proposed approach is applied to perform several experiments in two watersheds in South Dakota in the USA for searching a given number of best cells (1) minimizing sediment reaching the watershed outlet,(2) maximizing the environmental criteria, and (3) forming a compact patch. The results obtained with the IP formulation are in agreement with expert assessments of erosion levels, slopes and distances to the riverbeds.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Budget Constraint in Reforestation Meant for Minimizing Sediment Load at a Watershed Outlet

Policy and decision makers dealing with environmental conservation and land use planning often require identifying potential sites for contributing to minimize sediment flow reaching riverbeds. This could be one of the environmental objectives of reforestation initiatives. An Integer Programming (IP) formulation for selecting a predefined number of locations to minimize sediment load at a water...

متن کامل

VirtuCast: Multicast and Aggregation with In-Network Processing - An Exact Single-Commodity Algorithm

As the Internet becomes more virtualized and software-defined, new functionality is introduced in the network core: the distributed resources available in ISP central offices, universal nodes, or datacenter middleboxes can be used to process (e.g., filter, aggregate or duplicate) data. Based on this new networking paradigm, we formulate the Constrained Virtual Steiner Arborescence Problem (CVSA...

متن کامل

A Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning

The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...

متن کامل

The Constrained Virtual Steiner Arborescence Problem: Formal Definition, Single-Commodity Integer Programming Formulation and Computational Evaluation

As the Internet becomes more virtualized and software-defined, new functionality is introduced in the network core: the distributed resources available in ISP central offices, universal nodes, or datacenter middleboxes can be used to process (e.g., filter, aggregate or duplicate) data. Based on this new networking paradigm, we formulate the Constrained Virtual Steiner Arborescence Problem (CVSA...

متن کامل

Fast, Greedy Model Minimization for Unsupervised Tagging

Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer programming (IP) solver to do model minimization. However, solving this problem exactly using an integer programming formulation is intractable for practical purposes. We propose a novel two-stage greedy approximation sch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009